Simple Single and Multi-Facility Location Models using Great Circle Distance
نویسندگان
چکیده
Facility location problems (FLP) are widely studied in operations research and supply chain domains. The most common metric used such is the distance between two points, generally Euclidean (ED). When points/ locations on earth surface considered, ED may not be appropriate to analyse with. Hence, while modelling a facility earth, great circle (GCD) preferable for computing optimal location(s). different demand points assigned with weights based importance requirements. Weiszfeld’s algorithm employed locate an point(s) iteratively. point termed as “Geometric Median”. This paper presents simple models combining GCD, points. demonstrated single multi-facility problems.
منابع مشابه
Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
In the classical facility location problemwe are given a set of facilities, with associated opening costs, and a set of clients. The goal is to open a subset of facilities, and to connect each client to the closest open facility, so that the total connection and opening cost is minimized. In some applications, however, open facilities need to be connected via an infrastructure. Furthermore, con...
متن کاملUsing tropical optimization to solve constrained minimax single-facility location problems with rectilinear distance
We consider a constrained minimax single-facility location problem with addends on the plane with rectilinear distance. The problem is first formulated in a standard form, and then represented in terms of tropical mathematics as a constrained optimization problem. We apply methods and results of tropical optimization to obtain direct, explicit solutions to the optimization problem. The results ...
متن کاملSolving single facility goal Weber location problem using stochastic optimization methods
Location theory is one of the most important topics in optimization and operations research. In location problems, the goal is to find the location of one or more facilities in a way such that some criteria such as transportation costs, customer traveling distance, total service time, and cost of servicing are optimized. In this paper, we investigate the goal Weber location problem in which the...
متن کاملOptimal Facility Location under Various Distance Functions
We present e cient algorithms for two problems of facility location. In both problems we want to determine the location of a single facility with respect to n given sites. In the rst we seek a location that maximizes a weighted distance function between the facility and the sites, and in the second we nd a location that minimizes the sum (or sum of the squares) of the distances of k of the site...
متن کاملMulti-Commodity Connected Facility Location
In this paper we define the multi-commodity connected facility location (MCFL) problem, a natural generalization of the well-known multi-commodity rent-or-buy (MROB) and connected facility location (CFL) network design problems. Like in MROB, we wish to send one unit of flow from a set of sources to a set of sinks. This flow is supported by renting or buying edges. For each bought edge e, we pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ITM web of conferences
سال: 2021
ISSN: ['2271-2097', '2431-7578']
DOI: https://doi.org/10.1051/itmconf/20213701001